翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク fast marching method ： ウィキペディア英語版 fast marching method The fast marching method is a numerical method for solving boundary value problems of the Eikonal equation: : $F(x)|\backslash nabla\; T(x)|=1.$ Typically, such a problem describes the evolution of a closed curve as a function of time $T$ with speed $F(x)$ in the normal direction at a point $x$ on the curve. The speed function is specified, and the time at which the contour crosses a point $x$ is obtained by solving the equation. The algorithm is similar to Dijkstra's algorithm and uses the fact that information only flows outward from the seeding area. This problem is a special case of level set methods. More general algorithms exist but are normally slower. Extensions to non-flat (triangulated) domains solving: ::$F(x)|\backslash nabla\_S\; T(x)|=1,$ \,\, \mbox \,\, S, \, \mbox \,\, x\in S. was introduced by Ron Kimmel and James Sethian. Image:Fast_marching_maze.png| Maze as speed function shortest path Image:Fast_marching_multi_stencil_2nd_order.png|Distance map multi-stencils with random source points ==See also== * Level set method 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「fast marching method」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.